Per-queue stability analysis of a random access system

نویسندگان

  • Rocky K. C. Chang
  • Sum Lam
چکیده

up response of the pendulum starting at nearly the vertically downward position, with the remaining initial conditions zero. Notice that the response is very fast without any initial swinging of the pendulum. The following remarks are in order. • It is clear from the simulations that the stabilization mechanism of our controller consists of spinning-up the disk inertia to lift the pendulum, which might impose some unrealistic values to the disk speed. This should be contrasted with the alternative method of [9]—also studied in [1], [3]—where the energy is first pumped-up through a balancing motion before lifting the pendulum. Two drawbacks of the latter approach are the slow convergence and the need to switch the controller close to the upward position. From the theoretical viewpoint both methods also differ, our controller (as well as the one reported in [8]) stabilizes the equilibrium point, while the energy-pumping methods stabilizes the homoclinic orbit, hence the need for the switching. • Although we have solved the stabilization problem of the system (10) with any prescribed saturation of the control, when we come back to the original disk inertia pendulum (9), we have to add sin(x 1) to the above control. So the above procedure does not give an answer to the problem where the maximal torque that the motor can deliver is smaller than the maximal gravity torque. Simulations and experiments have shown that stability cannot be guaranteed if we impose this saturation limit. REFERENCES [1] K. Astrom and K. Furuta, " Swinging up a pendulum by energy control, " in Proc. Adding integrations, saturated controls and global asymptotic stabilization for feedforward systems, " IEEE Trans. Abstract—In this note, we have extended previous studies of the system stability of buffered ALOHA systems to study an individual queue's stability , i.e., per-queue stability. The main result obtained in this work is a necessary and sufficient per-queue stability condition, which can be computed analytically only for several cases. For other noncomputable cases, we have evaluated several inner and outer bounds. They are generally quite tight for not-so-asymmetric systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Queue-Length based Algorithms for Optimal End-to-End Throughput Allocation and Stability in Multi-hop Random Access Networks

We consider a model of wireless network with random (slotted-Aloha-type) access and with multi-hop flow routes. The goal is to devise distributed strategies for optimal utility-based end-to-end throughput allocation and queueing stability. We consider a class of queue back-pressure randomaccess algorithms (QBRA), where actual queue lengths of the flows (in each node’s close neighborhood) are us...

متن کامل

Wireless networks with retransmission diversity access mechanisms: stable throughput and delay properties

Building on the concept of retransmission diversity, a class of collision resolution protocols [(B)NDMA] has been introduced recently for wireless packet multiple access. These protocols provide the means for improved performance compared with random access and splitting-based collision resolution protocols at a moderate receiver complexity cost. However, stability of these protocols has not be...

متن کامل

A novel self-tuning feedback controller for active queue management supporting TCP flows

Wireless access points act as bridges between wireless and wired networks. Since the actually available bandwidth in wireless networks is much smaller than that in wired networks, there is a bandwidth disparity in channel capacity which makes the access point a significant network congestion point. The recently proposed active queue management (AQM) is an effective method used in wired network ...

متن کامل

Performance Analysis of Distributed Queueing Random Access Protocol - - DQRAP

Distributed Queueing Random Access Protocol (DQRAP) is a multi-access protocol for a broadcast channel that provides performance superior to any other protocol with respect to stability, delay, and throughput. DQRAP achieves this performance with a transmission queue TQ, a collision resolution queue RQ, and ternary feedback from as few as three minislots. Xu and Campbell introduced DQRAP and pr...

متن کامل

Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2001